#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#include <list>

#define sf(x) scanf("%d", &x)
#define pf(x) printf("%d ", x)
#define pf2(x,y) printf("%d %d ", x,y)
#define sf2(x,y) scanf("%d %d", &x,&y)
#define sff(x) scanf("%lf", &x)
#define pff(x) printf("%lf ", x)
#define ENDL printf("\n")
#define pfl(x) printf("%I64d ", x)
#define sfl(x) scanf("%I64d", &x)



using namespace std;


typedef long long ll;

int main()
{
	string s;
	cin>>s;
	ll a,b;
	while(!(s =="#"))
	{
		b=1; a =0;
		for (int i = 0; i<s.length();)
		{
			if (s[i] == 'n')
			{
				if (i!=0) b *=2;
				i+=5;
			} else
			{
				if (i!=0)
				{
					b *=2;
					if (a==0) a=90;
					else
					{
						a *=2;
						a = a + 90;
					}
				} else
				{
					a = 90;
				}
				i+=4;
			}
		}
		while (a%2 == 0 && a !=0 && b!=1)
		{
			a/=2;
			b/=2;
		}
		if (b==1)
		{
			pfl(a); ENDL;
		} else
		{
			printf("%I64d/%I64d\n", a, b);
		}
		cin>>s;
	}
	return 0;
}




